Event-driven design simulation

ABSTRACT

A simulation system that includes a simulation accelerator that uses parallel processing to accelerate the simulation of register transfer level codes (RTLs) while minimizing memory access latency is disclosed. The accelerator has an array of parallel computing resources. The simulation accelerator receives compiled RTLs in which the components of the design are mapped to instructions. The instructions are divided into groups, in which instructions belonging to a same group are logically independent of each other. The simulation accelerator fetches instructions and data for processing by the parallel computing resources for one group of instructions at a time.

CLAIM OF BENEFIT TO PRIOR APPLICATIONS

The present application claims the benefit of U.S. Provisional PatentApplication 62/304,110, titled “Event-Driven Processor”, filed Mar. 4,2016. U.S. Provisional Patent Application 62/304,110 is incorporatedherein by reference.

BACKGROUND

Verification of design by simulation is a key component of theengineering process for building complex hardware such as integratedcircuits (ICs). Design simulation helps engineers verify and validatethe intended function of a product under development, as well as themanufacturability of the product.

SUMMARY

Some embodiments of the disclosure provide a simulation systemconfigured to test a design by operating a testbench for the design. Thesimulation system includes a simulation storage, a simulation processor,and a simulation accelerator. The simulation processor is configured to(i) transport compiled design data from a host computing system to thesimulation storage, the compiled design data comprising compiledregister transfer levels (RTLs) of the design and compiled models of thetestbench and (ii) execute the compiled models to generate stimulus fortesting the compiled RTLs. The simulation accelerator is configured toexecute the compiled RTLs by using the stimulus generated by thesimulation processor. The simulation processor is operating an operatingsystem for managing file transfer between the simulation system and thehost computing system.

Some embodiments of the disclosure provide a computing device. Thecomputing device is configured to receive a specification of a digitalcircuit, the specification describing structures and behaviors of thedigital circuit. The computing device is configured to compile thespecification into a plurality of instructions, each instructionreceiving a set of inputs and producing a set of outputs. The computingdevice is further configured to identify logical and temporaldependencies among the plurality of instructions and divides theplurality of instructions into a plurality of groups of instructionsbased on the identified logical and temporal dependencies. Eachinstruction belonging to a group of instructions is logically andtemporally independent of any other instruction belonging to the group.

Some embodiments of the disclosure provide a method for simulating adesign. The method receives a specification of a digital circuit, thespecification comprising a plurality of instructions that are dividedinto a plurality of groups of instructions. Each instruction belongingto a group of instructions is logically and temporally independent ofany other instruction belonging to the group. The method selects a groupof instructions and executes the selected group of instructions byexecuting multiple instructions in the group in parallel by usingmultiple computing resources. In some embodiments, the method stores theplurality of groups of instructions at a set of dynamic random accessmemories (DRAMs), each DRAM having a plurality of pages. For each DRAM,instructions belonging to a same group are stored in a same page of theDRAM. The method selects a group of instructions and executes theselected group of instructions by selecting a page storing instructionsof the selected group from each DRAM and retrieving the instructions ofthe selected group from the selected page.

Some embodiments provide an integrated circuit (IC) that includes anarray of processors and an array of physical routing channels. Eachrouting channel is a dedicated channel for coupling a processor with acorresponding memory structure. The array of processors receives aspecification of a digital circuit. The specification includes aplurality of instructions that are divided into a plurality of groups ofinstructions. Each instruction belonging to a group of instructions islogically and temporally independent of any other instruction belongingto the group. The array of processors selects a group of instructionsand executes the selected group of instructions. Each processor in thearray of processors retrieves and executes a different subset of theinstructions in the selected group of instructions from the processor'scorresponding memory structure through the processor's dedicated routingchannel in the array of routing channels.

Some embodiments of the disclosure provide a method for simulating adesign. The method receives a specification of a digital circuit. Thespecification includes a plurality of instructions that are sorted intoa plurality of groups of instructions. Each instruction belonging to agroup of instructions is logically and temporally independent of anyother instruction belonging to the group. The method maintains a pendingevents table. Each word of the pending events table has a plurality ofbits, each bit indicating absence or presence of pending input event atan instruction in the plurality of instructions. The method selects agroup of instructions having pending input events by examining at leastone word of the pending events table and executes the selected group ofinstructions to produce outputs to serve as inputs for destinationinstructions in other groups. The method updates the pending eventstable by clearing bits in the pending events table that correspond toinputs of the selected group and setting bits in the pending eventstable that correspond to inputs of destination instructions.

Some embodiments of the disclosure provide a method for simulating adesign. The method receives a specification of a digital circuit. Thespecification includes a plurality of instructions for modelingbehaviors of the digital circuit. Each instruction specifying anoperation and a set of fan-out destinations. The method stores eachinstruction at a different memory location in an instruction memory. Themethod executes the plurality of instructions by (i) generating aninstruction address, (ii) using the generated instruction address tofetch the instruction from the instruction memory and to fetch theinstruction's inputs from a data memory, (iii) performing the operationspecified by the fetched instruction based on the fetched input data andproducing an output, and (iv) storing the output in a set of memorylocations of the data memory according to the set of fan-outdestinations specified by the instruction.

The preceding Summary is intended to serve as a brief introduction tosome embodiments of the disclosure. It is not meant to be anintroduction or overview of all inventive subject matter disclosed inthis document. The Detailed Description that follows and the Drawingsthat are referred to in the Detailed Description will further describethe embodiments described in the Summary as well as other embodiments.Accordingly, to understand all the embodiments described by thisdocument, a Summary, Detailed Description and the Drawings are provided.Moreover, the claimed subject matter is not to be limited by theillustrative details in the Summary, Detailed Description, and theDrawings, but rather is to be defined by the appended claims, becausethe claimed subject matter can be embodied in other specific formswithout departing from the spirit of the subject matter.

BRIEF DESCRIPTION OF THE DRAWINGS

The drawings are of illustrative embodiments. They do not illustrate allembodiments. Other embodiments may be used in addition or instead.Details that may be apparent or unnecessary may be omitted to save spaceor for more effective illustration. Some embodiments may be practicedwith additional components or steps and/or without all of the componentsor steps that are illustrated. When the same numeral appears indifferent drawings, it refers to the same or like components or steps.

FIG. 1a illustrates a simulation system according to some embodiments ofthe disclosure.

FIG. 1b illustrates the generation of the compiled design data based ona testbench.

FIG. 2 conceptually illustrates event driven simulation of a RTL.

FIGS. 3a-b illustrates the execution of instructions by the simulationaccelerator when simulating RTLs.

FIG. 4 illustrates a block diagram of the simulation accelerator forsome embodiments.

FIG. 5 illustrates the fetching of instruction and data in thesimulation accelerator.

FIG. 6 conceptually the sorting of instruction in an instruction cloudinto groups.

FIG. 7 conceptually illustrates the compiling of RTLs into sorted groupsof instructions.

FIG. 8 conceptually illustrates simulation accelerator executinginstructions that have been group-sorted.

FIG. 9 illustrates storing group-sorted instructions in a DRAM in whichinstructions belonging to the same group are stored in a same page inorder to reduce memory access latency.

FIG. 10 illustrates the fetching of group-sorted instructions from aDRAM that stores instructions belonging to each group in one DRAM page.

FIG. 11 illustrates the division of group-sorted instructions intomultiple channels of memories and ALUs.

FIG. 12 conceptually illustrates the usage of the event table and theevent time wheel storage.

FIGS. 13a-b conceptually illustrate the content of the event time wheelstorage, the event table, and the data memory in different time steps.

FIGS. 14a-d illustrate the use of event table and event time wheelduring execution of group-sorted instructions of a time step.

FIG. 15 illustrates the data flow during the execution of an instructionat the simulation accelerator.

FIG. 16 illustrates the format of the content in the instruction memoryand in the data memory.

FIG. 17 conceptually illustrates a process for performing RTLsimulations by using a simulation accelerator.

FIG. 18 conceptually illustrates a process for executing a group ofinstructions.

FIG. 19 conceptually illustrates a process for writing output data of anexecuted instruction to its fan-out locations.

FIG. 20 conceptually illustrates the queuing of output data writeoperations that are generated by execution of instructions.

FIG. 21 conceptually illustrates processes for moving output data fromthe write queue to the data memory.

FIG. 22 illustrates instrumentation by the simulation system.

FIG. 23 conceptually illustrates an electronic system with which someembodiments of the invention are implemented.

DETAILED DESCRIPTION

In the following detailed description, numerous specific details are setforth by way of examples in order to provide a thorough understanding ofthe relevant teachings. However, it should be apparent that the presentteachings may be practiced without such details. In other instances,well-known methods, procedures, components, and/or circuitry have beendescribed at a relatively high-level, without detail, in order to avoidunnecessarily obscuring aspects of the present teachings.

Software implementations of design simulators are traditionally reliedupon as the most flexible solution for simulating hardware andperforming design verification. Simulators compliant with IEEE 1800-2012support arbitrary mixtures of legacy C/C++, Verilog, and SystemVerilogusing methodologies ranging from the industry-standard UniversalVerification Methodology (UVM) to unstructured ad hoc approaches. Assoftware platforms, these products absorb productivity-enhancingsoftware engineering abstractions—object-oriented programming,re-entrant code, garbage collection, namespaces, etc.—and integrate theminto the verification community.

The effective capacity of software simulators expands along withadvancing computer speeds and memory resources. As the growth of centralprocessing unit (CPU) speeds began to plateau in recent years, parallelprocessing based on multiple cores with multi-threaded execution aretouted as the key to increased computing throughput. However,software-based simulators running on CPUs have been unable to realizethe promises of parallel computing due to fundamental mismatches betweenthe underlying hardware architecture and the specific demands of thetask. A key impediment to realizing the promises of parallel computingis memory access latency. Experimental results show that Verilogsimulations use fewer than 5% of the cycles for actual execution whilespending overwhelming majority of the remaining cycles waiting formemory access through layers of CPU cache.

An alternative to software design simulators is hardware emulator. Underhardware emulation, synthesized register transfer level (RTL)descriptions of digital circuits is mapped directly to FPGA logic blocksor specialized processors. The result is a cycle-accurate version of thetarget design running in hardware at speeds considerably greater thansoftware simulation. Every active block or processor is assigned aspecific set of synthesized gates to compute during each clock cycle. Inother words, hardware emulation simulates the design by completelyimplementing the design, albeit with relaxed timing requirements.

As a result of this hardware assignment, the computational efforts tocompile and map RTL onto emulator fabrics are significant. Furthermore,expanding the scope of an emulated design can become non-trivial,possibly triggering repartitioning or requiring physical expansion ofthe emulator substrate with more FPGAs or more processors. Thisnegatively impacts the efficiency of the compile-run-modify designiteration cycle. Furthermore, like the target system, its emulatedcounterpart employs only two-state logic while software simulatorsbenefit from the enhanced diagnostic capabilities granted by four-state(or more) logic. The loss of abstraction suffered in moving fromflexible software to fixed hardware impacts debugging in other ways aswell.

I. Simulation System

Some embodiments of the disclosure provide an improved simulationsystem. The simulation system has a simulation accelerator thataccelerates RTL simulations by hiding memory latency and exploitingavailable parallelism in the RTLs. The simulation system also has adedicated simulation processor for executing testbench codes. Thisallows the testbench codes to more efficiently interact with the RTLsthan relying on a general-purpose host computer to execute testbenchcodes.

FIG. 1a illustrates a simulation system 100 according to someembodiments of the disclosure. The simulation system 100 uses parallelprocessing to accelerate the simulation of a design while minimizingmemory access latency. The simulation system 100 receives usercommunications through a host computer 190. The simulation system 100also receives compiled design data 181-182 from a compiler 195 runningon a host computer 190.

The host computer 190 is a computing device that the user interfaceswhen using the simulation system 100. The host computer 190 includes ahost processor 199, a host storage 130, a set of input/output devices(I/O) 191 and display 192. It is a general-purpose computer thatincludes an operating system and provides a user interface through itsI/O 191 and its display device 192. The host processor 199 is also a CPUthat operates several layers of caching structure.

The host computer 190 receives commands from the user and directs thesimulation system 100 to perform operations based on the received usercommands, including initiating and/or terminating simulation. It alsocollects simulation results from the simulation system 100 and presentsthe result data to the user. In some embodiments, the host computer 190is running a simulation viewing application at a graphical userinterface (GUI) for presenting the collected simulation to the user. Insome embodiments, the host computer 190 and the simulation system 100are not physically in a same device, so they communicate through aninter-device communications medium such as Universal Serial Bus (USB),Ethernet cable, Bluetooth connections, wired or wireless networks, PCIor PCI-Express, etc. These inter-device communications mediums are oftenshared by multiple data sources and are typically of lower bandwidth andhigher latency than intra-device data transport mediums. To avoidslowing down the accelerated simulation operations of the simulationsystem 100, the host computer 190 in some embodiments does notparticipate in real-time simulation operations of the simulation system100. Its interaction with the simulation system 100 is limited tonon-real-time control operations such as configuration, reset,simulation start, simulation termination, interrupts, retrievingsimulation result, and other latency-tolerant operations.

The compiler 195 is a program that compiles the source files 180 intocompiled design files 181-183 by translating or converting the contentof the source file into data structures in formats that can beunderstood by the simulation processor 120 and/or the simulationaccelerator 110. As illustrated, the compiled design files 181-183includes files for compiled RTLs 181, compiled models 182, andcompilation residual items 183. The compiled RTLs 181 and the compiledmodels 182 are in a format that can be understood and operated upon bythe simulation system 100, while the compilation residual items 183 areto be handled by the host computer 190. In digital circuit design, RTLis a design abstraction which models a synchronous digital circuit interms of the flow of digital signals (data) between hardware registers,and the logical operations performed on those signals.

As illustrated, the host computer 190 operates the compiler program 195.In some embodiments, another computing device (not illustrated)operating the compiler program 195 compiles the source files 180 intothe compiled design files 181-183. The compiler 195 converts RTL codesinto compiled RTLs 181 that includes instructions for the simulationaccelerator 110. The compiler 195 also divides the instructions for thesimulation accelerator 110 into groups in order to facilitate parallelprocessing at the accelerator. The compiler 195 compiles models 172 intocompiled models 182. The compiled models 182 may include codes that areexecutable by the simulation processor 120 as well as instructions thatare executable by the simulation accelerator 110. The operations of thecompiler will be further described by reference to FIG. 7 below.

The host storage 130 is the main storage of the host computing system190. The host storage 130 stores the source files 180 for the compiler195 to access. The compiled result, namely the compiled design data181-183 are stored in the host storage 130. Among these, the compiledRTLs 181 and the compiled models 182 are transported to the simulationsystem 100 and stored in the simulation storage 135 prior to the startof the simulation. The compilation residual 183 are data structures inthe testbench that cannot be handled efficiently by the simulationsystem 100 so they remain in the host storage 130 to be processed by thehost processor 199.

The simulation system 100 is an electronic device that includes both asimulation accelerator 110 and a simulation processor 120. In someembodiments, the simulation system 100 also includes a simulationstorage 135 for storing data used by the simulation accelerator 110 andthe simulation processor 120. In some embodiments, the simulationaccelerator 110 and the simulation processor 120 are implemented indifferent ICs. In some embodiments, the simulation system 100 isimplemented by an IC that includes both the simulation accelerator 110and the simulation processor 120. The IC can be a field programmablegate array (FPGAs) or an Application Specific Integrated Circuit (ASIC).In some embodiments, the simulation processor 120 is an embeddedprocessor in an FPGA (e.g., an ARM processor) while the simulationaccelerator 110 is implemented by the FPGA's programmable resources. Thesimulation processor 120 and the simulation accelerator 110 arecommunicatively coupled by intra-device communications medium such asdedicated conductors or signal pathways. During design simulation, thesimulation processor 120 and the simulation accelerator 110 exchangereal-time data over the intra-device communications medium with littlelatency.

The simulation accelerator 110 is for simulating RTLs. It acceleratesthe simulation of the RTLs by performing parallel processing on thecompiled RTLs 181. Simulation accelerator 110 will be further describedby reference to Sections II and III below.

The simulation processor 120 is a processor or CPU dedicated toexecuting non-synthesizable testbench codes during design simulation(through some non-synthesizable testbench codes are compiled intoinstructions and executed by the simulation accelerator 110). Thesimulation processor 120 generates stimulus to the simulationaccelerator 110 for testing the RTLs. The simulation processor 120 alsoreceives responses from the accelerator 110 in real-time, which allowsthe simulation processor 120 to generate follow-up stimulus to thesimulation accelerator 110. The simulation processor 120 is alsoexecuting an operating system 125, which supports file managementoperations by the simulation system 100. Having its own operating system125 at the simulation processor 120 enables the simulation system 100 totransport (or retrieve) files and data (such as the compiled design data181 and 182) directly from the host storage 130 into the simulationstorage 135. The simulation system 100 therefore does not rely on thehost computer 190 for file access, thereby avoiding operationallatencies associated with data transport with the host computer system190.

The simulation storage 135 is on the same electronic device (or a sameIC) as the simulation processor 120 and the simulation accelerator 110so that the simulation processor 120 and the accelerator 110 can accessthe simulation storage 135 via fast intra-device communications medium.During design simulation, the simulation storage 135 provides thecompiled models 182 and the compiled RTLs 181 to the simulationaccelerator 110 and the simulation processor 120, which are in the formof instructions 141 for the simulation accelerator and testbenchprograms/data 142 for the simulation processor 120. The simulationstorage 100 also stores simulation result 185 produced by the simulationaccelerator 110 and by the simulation processor 120. The storedsimulation result 185 can be transported to the host computer 190 later.The use of the simulation storage 135 therefore minimizes the impact ofhost system latency, because the simulation processor 120 and thesimulation accelerator 110 can access the simulation storage 135 ratherthan the host system storage 130 during simulation.

FIG. 1b illustrates the generation of the compiled design data 181-183based on a testbench 160. A testbench is a virtual environment used toverify the correctness of a design or model of a digital circuit or aset of digital circuits. The testbench 160 specifies a virtualenvironment for testing a design 170 of digital circuits. The testbench160 can be viewed as including the design 170 and models 172. The design170 includes descriptions of behaviors and/or structures of a digitalcircuit or of a set of digital circuits being engineered. The models 172are models of the testing environment that provide stimulus to thedesign 170. The testbench 160 can also be viewed as includingsynthesizable codes 176 and programs 178. The synthesizable codes 176(also referred to as RTLs) are codes that can be synthesized intodigital circuit elements such as gates and/or transistors. The programs178 are codes that cannot be translated into digital circuit elements,but can nevertheless be executed to perform operations within thetestbench 160. In some embodiments, the testbench 160 may also includesimulation interface codes 177 such as VPI or PLI commands.

The design 170 is written in synthesizable codes that describe thestructures and/or behaviors of the design. For digital circuits, suchsynthesizable codes are RTLs written in Verilog, VHDL, or other types ofhardware description language. The design 170 is also referred to as thedevice under test (DUT), since the testbench is set up to simulate andtest the design 170. The RTLs that describe the design 170 are thereforereferred to as the DUT RTLs.

The models 172 are not part of the design and can be written in codesthat cannot be synthesized into digital circuits. These models can bewritten in Verilog, VHDL, System Verilog, but can also be written incommon computer programming languages such as C++.

The testbench 160 describes the testing platform for the design 170. Itmay include both synthesizable code and non-synthesizable code writtenin hardware description languages such as Verilog, VHDL, and SystemVerilog. In some embodiments, the testbench is written in languagecapable of supporting data exchange between programs (such as modelswritten in C++) and synthesizable codes (such as RTLs written inVerilog).

As illustrated, the testbench 160 (including the design 170 and themodels 172) is stored as a set of source files 180. The compiler 195compiles the source files 180 into the compiled design data 181-183. Thecompiled design data 181-183 are stored in the host storage 130, whilethe compiled design data 181-182 are also transported to the simulationstorage 135. The compiled design files 181-183 include files for thecompiled RTLs 181, the compiled models 182, and the compilationresiduals 183.

The compiled RTLs 181 is a set of processed data structures that arederived from the synthesizable codes 176. The synthesizable codes of thetestbench 160 (including the design 170) includes computational elementsand timing elements. Computational elements are units at whichcomputations take place. Timing elements are units at which signals,data, and result of computations are held for over a period of time. Ina synthesized digital circuit, timing elements correspond to delays,memories, registers, latches, or clocks, while computational elementscorrespond to Boolean gates, arithmetic units, or other types ofcombinational logic elements.

In the compiled RTLs 181, the computational elements are implemented asinstructions executable by the simulation accelerator 110 (i.e., asaccelerator instructions 141). These instructions of the compiled RTLsemulate or model the behaviors and/or structures of the design 170.These accelerator instructions perform computation operations such asBoolean computations (logic gates such as NAND, NOR, XOR, MUX, etc.),bitwise computations (shift, mask, etc.), arithmetic computations (add,subtract, multiply, divide, etc.), and other types of computationoperations that can be performed by the simulation accelerator 110.

The compiled models 182 are executable programs compiled fromnon-synthesizable codes 178 (such as those written in C++ and somenon-synthesizable Verilog syntax). These programs are executable by thesimulation processor 120 and the operating system 125 and delivered tothe simulation processor 120 as the testbench programs/data 142. Some ofthe compiled models are implemented as instructions that are executableat the simulation accelerator 110 (i.e., as accelerator instructions141). These instructions include program flow constructs (such asfor-loop, while-loop, branch, and initial block, etc.), data storageoperations (such as load, move, copy, delete, etc.), and other types ofinstructions that can be performed by the simulation accelerator 110.

The compilation residuals 183 are data specified in the testbench 160that cannot be processed by the simulation accelerator 110 or thesimulation processor 120. For example, the testbench 160 may includeelements that invoke resources that are not available in the simulationprocessor 120 or the simulation accelerator 110, such as display relatedcommands or user interface related commands. These commands are part ofthe residual 183 handled by the host computer 190, which has displayresource 192 and user interface resources 191. In some embodiments, somesimulation interface codes written in VPI or PLI are also handled by thehost computer 190 as part of the compilation residual 183.

Based on the compiled RTLs 181, the compiled models 182, and theresidual 183, the simulation system 100 conducts the testing of thedesign 170 by simulation in coordination with the host computer 190.Specifically, the simulation accelerator 110 performs simulation of thedesign 170 by executing the accelerator instructions 141 (from thecompiled RTLs 181 and/or from the compiled models 182), while thesimulation processor 120 uses testbench program/data 142 (from thecompiled models 182) to provide stimulus to the simulation accelerator110 and to capture responses from the simulation accelerator 110.

The simulation processor 120 uses the captured responses to producefurther stimulus for the simulation accelerator 110, and/or to generatedata that serve as part of the simulation results 185. The simulationresult 185 also includes instrumentation data about the design 170collected from the simulation accelerator 110. The simulation result 185is stored in the simulation storage 135, and the host computer 190retrieves the simulation result 185 and presents them to the user (e.g.,as part of a design verification program.) The host computer may alsoperform certain simulation tasks that cannot be performed by thesimulation accelerator 110 and the simulation processor 120.

II. Event Driven Simulation

In some embodiments, the simulation accelerator performs event drivensimulation when executing instructions compiled from RTLs and testbenchmodels. Event driven simulation is a simulation technique that modelsthe operations of a system as a discrete sequence of events in time.Each event occurs at a particular instant in time and marks a change ofstate in the system. Between consecutive events, no change in the systemis assumed to occur. Thus, the simulation can directly jump in time fromone event to the next.

FIG. 2 conceptually illustrates event driven simulation of a RTL 200.The RTL includes different RTL modules (Alpha, Gamma, and Delta). EachRTL module includes a set of computational elements that are temporallyseparated from other computational elements. Specifically, the RTLmodule Alpha includes a set of computational elements 211, the RTLmodule Gamma includes a set of computational elements 212, and the RTLmodule Delta includes a set of computational elements 213. Each set ofcomputational elements 211-213 performs computation at its correspondingspecified simulation time instants, also referred to as time steps. Inthe example illustrated, the set of computational elements 211 computeswhenever the signal “clock” is at a positive edge, the set ofcomputational elements 212 computes 2 nanoseconds after whenever thesignal “alpha” changes value, and the set of computational elements 213computes 1 nanosecond after whenever the signal gamma changes.(Nanosecond is chosen as the simulation time unit for this example forillustration purposes.)

Computational elements that are separated from other computationalelements by timing elements are collectively referred to as acombinational cloud. In an event driven simulation system, an event(e.g., signal change) propagates through the computational elements of acombinational cloud in the same time instant. The sets of computationalelements 211-213 can therefore be referred to as combinational clouds211-213, respectively. Each combinational cloud is compiled into a setof instructions for the accelerator 110.

To simulate the RTL 200 in the simulation system 100, the compiler 195converts the RTL into sets of computation instructions 221-223 for thesimulation accelerator 110. The computation instructions includeinstructions set 221 performing the operations of the combinationalcloud 211, instructions set 222 performing the operations of thecombinational cloud 212, and instructions set 223 performing theoperations of the combinational cloud 213.

The simulation accelerator 110 is an event driven simulator. Whensimulation time reaches a particular time step, the accelerator 110executes the instructions that have pending events for that particulartime step. In this example, the simulation accelerator 110 executes theinstructions in the set 221 when the simulation time reaches the timestep t+0 ns, the instructions in the set 222 when the simulation timereaches the time step t+2 ns, the instructions in the set 223 when thesimulation time reaches the time step t+3 ns, the instructions in theset 221 when the simulation time reaches the time step t+10 ns, so onand so forth. The accelerator 110 executes the instructions of each timestep as if events propagate through the computational elements of thetime step without elapsing any simulation time. It can also be saidthat, at each time step, the accelerator 110 executes all instructionshaving pending events scheduled for that time step.

A set of instructions that are scheduled to always execute at the samesimulation time step(s) is referred to as an instruction cloud. The setsof instructions 221-223 can therefore be referred to as instructionclouds 221-223, respectively. An instruction cloud can includeinstructions from the compiled RTLs 181 that perform the operations ofthe computation elements in a combinational cloud (such as combinationalclouds 211-213). An instruction cloud can also include instructions fromthe compiled models 182 that perform the operations of thenon-synthesizable testbench components.

FIGS. 3a-b illustrates the execution of instructions by the simulationaccelerator when simulating RTLs. The figures show the simulation of anexample design of a digital circuit 300, which includes a NOR gate “A”,a tri-state buffer “B”, and an output port “C”. The NOR gate “A” has twoinputs “A1” and “A2”. The tri-state buffer “B” has two inputs “B1” and“B2”. The input “B1” is connected to the output of the NOR gate “A”. Theinput “B1” is the tri-state control of the tri-state buffer “B”. Whenthe input B1 is high, the input “B2” is allowed to reach the output port“C”. When the input B1 is low, the tri-state buffer “B” is tri-statedand the port “C” is also tri-stated.

The accelerator 110 uses several data structures when performingsimulation. These data structures include an instruction memory 310, adata memory 320, and an event table 330. The compiler 195 compiles theRTL of the circuit 300 into instructions that can be executed by theaccelerator 110, and the accelerator 110 stores the instructions in theinstruction memory 310. Each instruction has a corresponding set ofinput data (i.e., the signal value currently sitting at the input of theinstruction), and the accelerator stores the input data of eachinstruction at a corresponding location in the data memory 320 for eachinstruction. The accelerator 110 would execute an instruction only whenat least one of the instruction's input data has changed (i.e., there isa pending event at an input of the instruction, or a pending inputevent). The accelerator uses the event table 330 to keep track of whichinstructions have pending input events and to identify whichinstructions need to be executed.

FIGS. 3a-b illustrate the accelerator performing the simulation of thedigital circuit 300 by using the instruction memory 310, the data memory320, and the event table 330 in six stages 301-306. The accelerator 110has already loaded the instruction memory with the compiled instructionsthat corresponds to the components of the digital circuit 300, includingan instruction 351 for performing the operations of the NOR gate “A”, aninstruction 352 for performing the operations of the tri-state buffer“B”, and an instruction 353 for performing the operations of the outputport “C”.

At the first stage 301, the simulation is at time step n−1. According tothe content of the data memory 320, the inputs “A1” and “A2” of theinstruction 351 are respectively at ‘0’ and 1′, the inputs B1 and B2 ofthe instruction 352 are respectively at ‘0’ and ‘X’ (unknown), and theinput “C1” of the instruction 353 is at Z (tri-stated). According to theevent table 330, there is no pending event at any of the inputs to theinstructions 351-353. This reflect the fact that the output of the NORgate “A” and the output of the tri-state buffer “B” are both up-to-datewith respect to their inputs, and there is no need to execute theinstructions 351-353.

It is worth noting that, the simulation accelerator 110 is based oncomputation of instructions where the propagation of signals isexpressed as values stored in memories. It is therefore capable ofexpressing signal values using 4-state logic, i.e., ‘1’, ‘0’, ‘X’, and‘Z’. This is unlike hardware emulators, where the signals can only beeither ‘1’ or ‘0’ because they are carried by actual physical wires.Furthermore, in some embodiments, instructions can handle inputs andoutputs that are of complex data types, not merely bit values.

At the second stage 302, the simulation has progressed to time step n.According to the event table 330, there is a pending event at the A2input of the instruction 351 (NOR gate “A”). According to the datamemory 310, the value at the A2 input has changed from ‘1’ to ‘0’. Thesimulation accelerator 110 has not executed the instruction 351, theoutput of the NOR gate therefore remain the same as before (still at‘0’), which is out of date.

At the third stage 303, the simulation is still at time step n. However,based on the content of the event table 330, the accelerator 110 selectsthe instruction 351 for execution because it has pending input event atits input A2.

At the fourth stage 304, the simulation remains at time step n. Theexecution of the instruction 351 has produced a new output value ‘1’,which causes the input data of B1 of the instruction 352 (tri-statebuffer “B”) to change from ‘0’ to ‘1’ in the data memory 320. At theevent table 330, the execution of the instruction 351 clears the pendinginput event at A2 and set a new pending input event at the B1. Theoutput of the tri-state buffer “B” however remains at ‘Z”, which is outof date.

At the fifth stage 305, the simulation remains at time step n. Based onthe content of the event table 330, the accelerator 110 selects theinstruction 352 (tri-state buffer “B”) for execution because it haspending input event at its input B1.

At the sixth stage 306, the simulation remains at time step n. Theexecution of the instruction 352 has caused the tri-state buffer “B” toopen, which allows the input data at B2 to reach the output of thebuffer and change the output of the tri-state buffer. Since the B2 inputis ‘X’ (unknown), the output of the tri-state buffer “B” also becomes‘X’. The output of the tri-state buffer “B” fan-out to the output port“C”, changing the value of the input C1 to ‘X’. At the event table 330,the execution of the instruction 352 clears the pending input event atB1 and set a new pending event at the C1.

III. Simulation Accelerator

A. Architecture

As mentioned, the simulation system 100 includes a simulationaccelerator 110 that uses parallel processing to accelerate thesimulation of RTLs while minimizing memory access latency. In someembodiments, the accelerator has an array of parallel computingresources. The simulation accelerator receives a processed (i.e.,compiled) version of the design in which the components of the designare mapped to instructions for the parallel computing resources. Theinstructions in the processed version of the design are divided intogroups, in which instructions belonging to a same group are logicallyindependent of each other. The simulation accelerator fetchesinstructions and data for processing by the parallel computing resourcesfor one group of instructions at a time. Since all instructions thuslyfetched are logically independent of each other, the parallel computingresources are free to execute the instructions of a group in paralleland/or in any arbitrary order. In addition, since no instruction has towait for the completion of another instruction before being fetched orexecuted, the simulation accelerator can retrieve a block ofinstructions in a burst or streaming manner. This minimizes the effectof memory access latency during RTL simulation.

FIG. 4 illustrates a block diagram of the simulation accelerator 110 forsome embodiments. As illustrated, the accelerator includes theinstruction memory 310, the data memory 320, along with an instructiondata fetching unit 410, a streaming buffer 415, a data access unit 420,an event manager 430, and an array of arithmetic logic units (ALUs) 440.In some embodiments in which the simulation accelerator is implementedas digital hardware such as an integrated circuit (IC), these variousblocks or modules are implemented by sets of digital circuits. In someembodiments in which the simulation accelerator 110 is implemented assoftware or firmware being executed by one or more processing units(e.g., processors), these various blocks or modules are implemented assoftware modules or sets of instructions.

The compiled instructions are stored at the instruction memory 310 andthe inputs to the instructions are stored in the data memory 320. TheInstruction/Data fetching unit 410 fetches the instructions and theircorresponding input data from those memory structures and stores thefetched instruction and data in the streaming buffer 415. The streamingbuffer 415 is a buffer between the fetching of instructions from theinstruction memory and the execution of the instructions by the array ofALUs 440. Each ALU in the array 440 is an arithmetic and/or logicalprocessing units that executes instructions based on the input data toproduce output data. Each instruction stored in the streaming buffer isreceived and executed by only one ALU, and each ALU executes eachreceived instruction independently of other ALUs. The data access unit420 receives the output values computed by the ALUs 440 and stores themin the data memory 320 to serve as input data for other instructions.The data access unit 420 also stores the computed output values assimulation result 185 (to be stored in the simulation storage 135 andreported to the host computer 190).

The event manager 430 maintains the event table 330. It reports thecontent of the event table 330 to the instruction/data fetching unit 410so it is able to identify instructions having pending input event anddecides which instruction to fetch. It also updates the content of theevent table 330 by observing, from the data access unit 420, whichinstructions are being executed and which inputs of which instructionsare being updated as the result. The event manager 430 also maintains anevent time wheel storage (or event wheel) that stores pending inputevents for future time steps. The event manager, the event table, andthe event time wheel storage will be further descried below in SectionIII.C.

As mentioned, the received instructions are organized into groups, whereinstructions in a same group are logically independent of each other.The instruction/data fetching unit 410 retrieves instructions from onegroup at a time, and the ALUs receives and executes instructions fromthe same group before receiving and executing instructions from the nextgroup. FIG. 5 illustrates the fetching of instruction and data in thesimulation accelerator 110.

The figure illustrates a time line at the instruction memory 310 and atthe data memory 320. Between time T0 and T1, the instruction/datafetching unit 410 is fetching instructions and data for an instructiongroup 511. The group 511 includes instructions I0 through I5 (withcorresponding input data D0 through D5). Since I0 through I5 areinstructions that are logically independent of each other, theinstruction/data fetching unit 410 would never have to wait for oneinstruction to complete before deciding which instruction to fetch next.Consequently, the instructions of the group 511 can be retrieved in aburst fashion, thereby minimizing memory access latency.

Between the time T2 and T3, the data access unit 410 is writing theoutput data of the instructions in the group 511 (instructions I0-I5) tothe data memory 320. The output data are written into the data memory320 to serve as input data for other instructions. Since theinstructions in the group 511 are logically independent of each other,their output data is always for instructions of other groups and cannever possibly become input data of the instructions in the group 511.The write operation of an output data may therefore occur as soon as theinstruction that produces the output data is executed (i.e., T2 mayoccur before T1). The write operation of the output data may also bedelayed (i.e., queued) until there is an opportunity to write the outputdata into the data memory 320. The logical independence of instructionswithin a same group facilitates timing flexibility in the writeoperations, which further reduces memory access latency.

After time T4 (and after the ALUs finish executing the instructions inthe group 511), the instruction/data fetching unit 410 fetchesinstructions and data for another instruction group 512. Theinstructions in the group 512 are logically independent of each other,but they maybe logically dependent upon the instructions in the group511. The execution of the group 512 therefore starts only after updateto input data has completed. In some embodiments, the accelerator wouldnot execute a group of instructions until all write operations to thedata memory 320 have completed. Since the fetching of the instructionsin the group 512 occur only after the ALUs in the array 440 havecompleted executing the instructions of the previous group 511, it isassured that the ALUs are receiving and executing instructions from thesame group. The ALUs in the array 440 can therefore execute fetchedinstructions in parallel since the instructions being executed by thedifferent ALUs are logically independent of each other.

The simulation accelerator 110 therefore accelerates the simulation ofRTLs in several ways. By processing the compiled instructions as groups,the array of ALUs can fully function as parallel computing resources toaccelerate the simulation of the DUT RTL. The logical independence ofthe instructions in each group also allows the simulation accelerator110 to minimize memory access latency by burst mode. The memory accesslatency is further reduced in comparison to general-purpose computer(such as the host computer) because the fetching of the instructions anddata does not go through layers of caching structure. In someembodiments, the ALUs not only perform instructions in parallel, theyalso supports an instruction set that is tailored toward RTL simulation.Such an instruction set in some embodiments includes instructions thatmatch Verilog commands or constructs, which are not available in generalpurpose CPUs. A single instruction for the simulation accelerator canencompass a sequence of x86 instructions while also handling eithertwo-state or four-state logic.

B. Group Sort

The simulation accelerator is able to execute the instructions of thecompiled RTLs in parallel. This is because the instructions of thecompiled RTLs are sorted into groups, each group having instructionsthat are logically independent of each other. More generally, thesimulation receives instructions that are sorted into groups so that thesimulation accelerator can execute the instructions in parallel. Theseinstructions can come from the compiled RTLs and/or the compiled models.

FIG. 6 conceptually illustrates the sorting of instructions in aninstruction cloud into groups. The figure illustrates an instructioncloud 600. The instructions of the instruction cloud 600 are scheduledto execute at the same time step(s) during event driven simulations bythe simulation accelerator 110. The instructions cloud 600 may includeinstructions that correspond to computational elements in a combinationcloud of a compiled RTL. The instructions cloud 600 may also includeinstructions that correspond to non-synthesizable constructs of thetestbench (i.e., from the compiled models of the testbench.)

As illustrated, the instruction cloud 600 includes 26 instructions,labeled A through Z. Each solid line connecting the output of aparticular instruction to one or more inputs of other instructionsrepresent the fan-out or propagation of output data from the particularinstruction to the other instructions. For example, the output of theinstruction Q is connected to inputs of instructions R and S, so theoutput of the instruction Q fans out to instructions R and S. Aparticular instruction is said to be logically dependent on anotherinstruction if a change at the output of the other instruction affect aninput of the particular instruction. For example, the instruction Lreceives inputs from the outputs of instructions F and K, so theinstruction L is logically dependent on instructions F and K.Furthermore, since instruction F receives an input from the output ofinstruction D and instruction D receives an input from instruction C,instruction L is also logically dependent on instructions D and C. It isworth noting that two instructions are considered logically independentof each other as long as they do not affect each other's input duringthe same time step. Whether the output of one instruction affects theinput of another instruction at a future time step is irrelevant to thedetermination of logical dependencies.

According to the logical dependencies of the instruction cloud 600, thecompiler sorts the instructions of the instruction cloud 600 into sixgroups 1 through 6 (each instruction is labeled with its group number.)Group 1 includes instructions A, C, J, O, and P. Group 2 includes B, D,E, K, and Q. Group 3 includes F, G, R, and S. Group 4 includes H, I, L,T, and V. Group 5 includes instructions M, U, and X. Group 6 includesinstructions N, W, Y, and Z. As illustrated, within each group, theinstructions are logically independent of each other, i.e., noinstruction depends on another instruction of the same group for itsinput (directly or indirectly). For example, the group 2 has fiveinstructions B, D, E, K, and Q. These five instructions are logicallyindependent of each other. A change at the output of instruction B wouldnot affect the inputs of D, E, K, and Q, and a change at the output ofinstruction D would not affect the inputs of instructions B, E, K, andQ, so on and so forth. It is worth noting that each group ofinstructions may include both instructions implementing computationalelements in RTLs and instructions implementing non-synthesizabletestbench components.

In some embodiments, the compiler 195 performs group sort oninstructions of an instruction cloud by (1) identifying instructionsthat depend only on input ports of the instruction cloud as the initialgroup, (2) identifying instructions that depend only on input ports oroutputs of the first group as the second group, (3), identifyinginstructions that depend only on the input ports or the outputs of thefirst or second groups as the third group, and so on and so forth. Inother words, the compiler (at the group-sort stage) identifies eachsuccessive group by identifying instructions that depend only on inputports of the instruction cloud or outputs of instructions alreadyidentified as belonging to previously identified group(s). In theexample of FIG. 6, the group sort start from instructions A, C, J, O, P,as these are the instructions that depend on only the input ports of theinstruction cloud 600, while other instructions have at least one inputthat depend on other instructions of the instruction cloud 600.

FIG. 7 conceptually illustrates the compiling of RTLs into sorted groupsof instructions 790. The figure illustrates the compiler 195 compiling asource file 710 containing a testbench to be simulated. The source file700 contains RTLs. The RTLs include different modules that may be activeat different time steps, including RTL modules 721, 722, and 723. RTLmodules 721, 722, and 723 correspond to different sets of computationalelements (or combinational clouds) that are temporally separated bytiming elements such as delays, memories, registers, latches, or clocks.

As illustrated, the compiler 195 includes two stages: anRTL-to-instructions stage 791 and a group sort stage 792. TheRTL-to-instructions stage 791 is for compiling the RTLs from theiroriginal hardware description language coding (e.g., Verilog) intoinstructions that are executable by the simulation accelerator 110, withcomputational elements of combination clouds (and some testbench models)compiled into instructions of instruction clouds. In some embodiments,the RTL-to-instruction stage 791 performs Boolean optimization whenconverting RTL code into simulation accelerator instructions. The groupsort stage 792 is for sorting the compiled instructions of eachinstruction cloud into groups, where instructions in each group arelogically independent of each other as described above by reference toFIG. 6.

The RTL-to-instruction stage 791 compiles the RTL module 721 into a setof instructions 731, the RTL module 722 into a set of instructions 732,and the RTL module 723 into a set of instructions 733. The set ofinstructions 731 has the same instructions as the instruction cloud 600of FIG. 6 (i.e., instructions A through Z). The group sort stage 792performs group sort on the instruction sets 731, 732, and 733 separatelyas they belong to different instruction clouds that may be active indifferent time steps, i.e., instructions belonging to differentinstruction clouds are sorted into groups belonging to differentinstruction clouds. The instructions in the set 731 are sorted intogroups of instructions 741 that include the groups 1, 2, 3, 4, 5, and 6as illustrated in FIG. 6. The instructions in the set 732 are sortedinto groups of instructions 742 that include groups 7, 8, 9, 10, and 11.The instructions in the set 732 are sorted into groups of instructions743 that include groups 12, 13, 14, and 15. The sorted instructions 741,742, and 743 are exported as the group-sorted instructions 790 of thesource file 710.

FIG. 8 conceptually illustrates simulation accelerator executinginstructions that have been group-sorted. Specifically, the figureillustrates how group-sorted instructions enables parallel processingwhen performing the RTL simulation at the simulation accelerator 110.

The figure illustrates the ALUs 440 of the simulation accelerator 110receiving and executing instructions that have been group-sorted. Theinstruction fetching mechanism of the accelerator 110 (i.e., theinstruction/data fetching unit 410 and the streaming buffer 415)retrieves data from the instruction memory 310, which stores thegroup-sorted instructions 790 produced by the compiler 195. For eachtime step, the instruction/data fetching unit fetches the groups thathave pending events in that time step for execution. As illustrated, forthe time step n, the instruction/data fetching unit 410 fetches groups 1through 6 because they have pending events at time step n. For the timestep n+1, the instruction/data fetching unit 410 fetches groups 7through 11 because they have pending events at time step n+1. For timestep n+2, the instruction/data fetching unit 410 fetches groups 1-6 aswell as groups 12-15. Groups 12-15 belong to a different instructioncloud as groups 1-6, but they all have pending events at time step n+2.

The ALUs 440 executes the fetched instructions group by group. As anexample, the figure illustrates the ALUs 440 executing instructions ofgroup 2 of the instruction cloud 600. Group 2 includes five instructionsB, D, E, K, and Q. Since these instructions belong to the same group andare logically independent of each other, they can be executed in anyorder by any of the ALUs 440. The ALUs execute the instructions inparallel, and each of the ALUs in the array 440 executes a differentsubset of the instructions in the group. As illustrated, the ALU 441executes instructions B and D, the ALU 442 executes instructions E andK, and the ALU 443 executes the instruction Q.

Different embodiments employ different methods of assigning instructionsto ALUs. In some embodiment, each ALU executes an instruction from thestreaming buffer as soon as it is free to execute a next instruction. Insome embodiments, a load balancing mechanism distributes theinstructions to the ALUs in the array 440 to balance workload betweenthe different ALUs. Such load balancing can be random, based on a hash,round robin, or other types of mechanisms. In some embodiments, the ALUassignment of the instructions is determined by the compiler 195, andthat the streaming buffer sends each instruction to its correspondingALU based on the predetermined assignment. In some of these embodiments,the assignment of instructions to ALUs is based on the complexity ofinstructions or expected execution time of instructions. Each ALU isassigned a different mix of instructions such that the different ALUsare expected to finish their assigned instructions around the same time.

In some embodiments, in order to save cost and increase memory datadensity, the simulation accelerator 110 employs dynamic random accessmemories (DRAMs) as the instruction memory 310 and the data memory 320.DRAMs are organized into pages. In some embodiments, the DRAMs arephysical devices external to the IC that implements the simulationaccelerator 110.

To read a data bit stored in particular page requires accessing of thatpage, which takes time and subjected to significant memory accesslatency. However, once the DRAM page is accessed, each subsequent accessfor data in that page requires far less time and subject to far lessmemory access latency. In order to minimize memory access latency forretrieving instruction or data, the simulation accelerator in someembodiments stores instructions belonging to a same group in a same pageof a DRAM.

FIG. 9 illustrates storing group-sorted instructions in a DRAM in whichinstructions belonging to the same group are stored in a same page inorder to reduce memory access latency. The figure illustrates theinstruction memory 310 implemented in a DRAM 900. The DRAM has at leastfour pages 911-914. The groups 1-6 of the instruction cloud 600 arestored in the four pages 911-914. The instructions of each group areconfined to one page, though a page may store instructions belonging tomultiple different groups. As illustrated, all instructions of group 1(A, C, J, O, and P) are in page 1. All instructions of group 2 (B, D, E,K, Q) are also in page 1. All instructions of group 3 (F, G, R, and S)are in page 2. All instructions of group 4 (H, I, L, T, V) are in page2. All instructions of group 5 (M, U, and X) are in page 3. Allinstructions of group 6 (N, W, Y, and Z) are in page 4. Thus, when theinstruction/data fetching unit 410 fetches instructions of a group forexecution at the ALUs 440, the retrieval of the instructions can stay inthe same page. This minimizes memory access latency.

FIG. 10 illustrates the fetching of group-sorted instructions from aDRAM that stores instructions belonging to each group in one DRAM page.The figure illustrates the fetching of the group-sorted instructions ofthe instruction cloud 600. The figure shows a time line for fetchinginstructions belonging to groups 1, 2, 3, 4, 5, and 6.

The instruction/data fetching unit starts by fetching instructions ofgroup 1. Since the instructions of group 1 are all in page 1, theinstruction/data fetching unit can retrieve all instructions of group 1(A, J, C, O, P) by performing setup for accessing page 1 once (e.g., bypre-charging page 1 and setting row address). The instruction/datafetching unit then retrieve the instructions of group 2 (B, D, E, K, Q).Since the instructions of group 2 are also stored at page 1, theinstruction/data fetching unit retrieves the instructions of group 2without performing page setup.

The instruction/data fetching unit then fetches the instructions ofgroup 3 (F, G, R, S). Since instructions of group 3 are not in page 1but on page 2, the instruction/data fetching unit has to wait for page 2to be setup/accessed before proceeding to retrieve the instructions ofgroup 3. The instruction/data fetching unit then retrieve theinstructions of group 4 (H, I, L, T, V) without performing page setupsince group 4 instructions also reside in page 2.

The instruction/data fetching unit then fetches the instructions ofgroup 5 (M, U, X). Since the instructions of group 5 are not in page 2but on page 3, the instruction/data fetching unit has to wait for page 3to be setup/accessed before proceeding to retrieve the instructions ofgroup 5. The instruction/data fetching unit then fetches theinstructions of group 6 (N, W, Y, Z). Since the instructions of group 6are not in page 3 but on page 4, the instruction/data fetching unit hasto wait for page 4 to be setup/accessed before proceeding to retrievethe instructions of group 6.

The instruction memory 310 is illustrated in FIG. 9 as being accessibleto all ALUs in the array 440 so that any instruction stored in theinstruction memory can be executed by any of the ALUs. However, whenthere is sufficiently large number of ALUs in the parallel processingarray, it can be difficult to physically route data from the instructionmemory to the ALUs. In some embodiments, the instruction memory 310 isdivided into multiple channels, each channel serving one ALU in thearray of ALUs 440. Since instructions belonging to the same group arelogically independent of each other, instructions assigned to differentchannels of memories and ALUs can be safely executed in parallel.

In some embodiments in which the instruction memories are implemented byDRAMs, the data memories are also implemented by DRAMs, and that theinput to each instruction is stored in a DRAM page of the data memorythat corresponds to a DRAM page in the instruction memory that storesthe instruction. In some embodiments in which the instructions arestored at instruction memories of different physical channels, theinputs to the instructions are correspondingly stored at data memoriesof different physical channels.

FIG. 11 illustrates the division of group-sorted instructions intomultiple channels of memories and ALUs. The figure illustrates theinstructions of the instruction cloud 600 being assigned to threechannels 1111-1113. Each channel includes an instruction memory, aninstruction/data fetching unit, a streaming buffer, and an ALU.Specifically, the channel 1111 includes a memory structure 901, aninstruction/data fetching unit 1111, a streaming buffer 1121, and an ALU441; the channel 1112 includes a memory structure 902, aninstruction/data fetching unit 1112, a streaming buffer 1122, and an ALU442; and the channel 1113 includes a memory structure 903, aninstruction/data fetching unit 1113, a streaming buffer 1123, and an ALU443. The ALUs 441-443 are part of the array of ALUs 440.

As illustrated, the instructions of each group are divided among theinstruction memories of different channels. For example, for group 1,instructions A and C are stored in the memory 901 of channel 1111,instructions J and 0 are stored in the memory 902 of channel 1112, andinstruction P is stored in the memory 903 of channel 1113. The ALU 441only executes instructions fetched by the instruction/data fetching unit1111, which fetches only instructions from the memory structure 901. TheALU 442 only execute instructions fetched by the instruction/datafetching unit 1112, which fetches only instructions from the memorystructure 902. The ALU 443 only execute instructions fetched by theinstruction/data fetching unit 1113, which fetches only instructionsfrom the memory structure 903. This minimizes the routing between theALUs and the instruction memory.

As mentioned, the instruction memory 310 can be implemented by usingDRAMs, and the instructions belonging to a same group are stored in asame DRAM page. In the scenario of having the instruction memory dividedinto different channels, the DRAM of each channel stores instructionsbelonging to the same group at a same page, albeit DRAMs of differentchannels store different subsets of instructions from the same group. Asillustrated, the DRAM 901, 902, and 903 all store instructions belongingto groups 1, 2, 3, 4, 5, and 6. All three DRAMs store their groups 1 and2 instructions in page 1, groups 3 and 4 instructions in page 2, group 5instructions in page 3, and group 6 instructions in page 4.

As mentioned, since the instructions belonging to the same group arelogically independent of each other, they can be executed in any orderby any ALUs in the array. For example, an ALU may execute theinstructions of group 1 in the order of:

A, C, J, O, P

The same ALU may also execute the instructions of group 1 in the orderof:

C, O, A, P, J.

In some embodiments, an ALU may execute an instruction in multiplephases, and the ALU may execute a later phase of the multi-phaseinstruction after an arbitrary number of other instructions. Forexample, say the instruction ‘C’ is a multi-phase instruction that isexecuted as phase “C1” and “C2”, then the ALU may execute theinstructions of group 1 in the order of:

A, C1, C2, J, O, P.

But the ALU may also execute the instructions of group 1 in the orderof:

C1, O, A, P, J, C2

or:

J, C1, P, O, C2, A.

In other words, as long as the different phases of the multi-phaseinstruction are executed in order relative to each other, the ALU mayexecute each phase of the multi-phase instruction in any order relativeto other instructions.

An example of an instruction that is executed as a multi-phaseinstruction is an indexed memory load instruction. The ALU executes afirst phase to fetch the index and then a second phase to use thefetched index to fetch the memory content. The ALU in some embodimentshandles the first phase of the load instruction in a separate pipelinewhile executing other instructions. The ALU would return to execute thesecond phase after the separate pipeline of the first phase hascompleted, which is also after some of the other instructions in thegroup has completed. This is permissible because the instructions belongto the same group are logically independent of each other and can beexecuted in any order.

C. Event Management

As mentioned, an instruction cloud is a collection of instructions thatare scheduled to execute at the same time step(s). However, in someembodiments, the accelerator would actually execute an instruction onlyif the instruction has a pending input event. The accelerator uses theevent table to keep track of pending input events and to identifyinstructions that need to be executed.

As instructions in each group are executed, the destinations of theiroutputs (also referred to as their fan-outs) may have new pending inputevent. Some of these destinations are instructions in other groups ofthe current time step. Some of these destinations are instructions to beexecuted at a future time step. For destination instructions that are inthe same current time step as the executed instruction, the simulationaccelerator uses the event table to keep track of new pending inputevents. For destination instructions that are in a future time step, thesimulation accelerator stores the new pending input events in a storage(referred to as a “time wheel”) until the future time step arrives. Oncethat future time step arrives, the simulation accelerator uses thecontent of the time wheel storage to populate the event table for theinstructions of that time step.

FIG. 12 conceptually illustrates the usage of the event table and theevent time wheel storage. The figure illustrates the relationshipbetween the event table 330, the event time wheel storage 340, the datamemory 320, and a compiled RTL 1210 across different time steps. Thecompiled RTL includes instructions that are to be executed at differenttime steps.

As illustrated, when the simulation time arrives at time step n, thesimulation accelerator initializes the event table with the content ofevent time wheel 340. The event time wheel is filled with pending eventsgenerated by instructions executed at time step n−1 or before. The eventtime wheel is also filled with stimulus supplied by the testbench (e.g.,generated by the simulation processor 120 executing programs and data142 based on the compiled models 182). The stimulus specifies what datais to be applied and at what simulation time steps. As the simulationaccelerator 110 executes the instructions of the time step n based oninput data stored in the data memory 320 and generates pending eventsfor destination instructions, it updates the event table 330 and theevent time wheel 340. It also writes output data into the data memory320 as input data to destination instructions. For destinationinstructions that are in time step n, the simulation accelerator updatesthe event table 330. For destination instructions that are in time stepn+1 or after, the simulation accelerator stores the new pending inputevents in the event time wheel storage 340.

FIGS. 13a-b conceptually illustrate the content of the event time wheelstorage 340, the event table 330, and the data memory 320 in differenttime steps.

FIG. 13a illustrates the content of the event time wheel 340 and thecontent of the event table 330 at a time step 1000 ns. At the time step1000 ns, the instructions of the instruction cloud 600 (i.e.,instructions A-Z) are scheduled to execute. The event time wheel 340records pending input event for this time step (1000 ns) and otherfuture time steps (1003 ns and 1010 ns) based on testbench stimulusand/or based on execution of previous time steps. As illustrated, thecontent of the event time wheel 340 indicates that there are pendinginput event at instructions A, C, J, O, P, S, T for the time step 1000ns, as well as pending input event at instruction “jj” at 1003 ns, andinstructions O and T at time step 1010 ns.

The data memory 320 stores the input data of every instruction in thecompiled RTL, including those scheduled to be executed in this time step(i.e., instructions A-Z). The input data of some of the instructions arenewly updated because of new pending input events (illustrated in bold,such as input data for instructions A, C, J, O, P, S, T).

The event table 330 keeps track of pending input events forinstructions. In some embodiments, the event table maintains onlypending input events for the instructions that are scheduled to executefor the current time step. When the simulation time initially arrives ata particular time step, the accelerator populates the event table 330based on the pending input events for the current time step stored inthe event time wheel 340. (The events from previous time steps wouldhave already been cleared).

In some embodiments, the event table 330 is maintained as a collectionor a scoreboard of bits, each bit indicating absence or presence ofpending event at an input of an instruction. The event table 330 istherefore also referred to as a pending events table. Each instructionhas a corresponding bit in the event table 330 for indicating whetherthere is a pending input event for the instruction. In some embodiments,each input of each instruction has a corresponding bit for indicatingwhether there is a pending event at that input. As illustrated in Figure#13 a, bits in the event table 330 that correspond to instructions A, C,J, O, P, S, and T are set to indicate pending event at theseinstructions, while bits correspond to other instructions are cleared toindicate that there are no pending events at those other instructions.In some other embodiments (not illustrated), the event table only keepstrack of whether an instruction has any pending input event at all(i.e., whether the instruction has least one input with input event),rather than keeping track of pending events for each input of eachinstruction.

In the example illustrated in FIG. 13a , the event table 330 keeps trackof pending events for instructions in groups 1-6, as these are theinstructions that are scheduled to execute in the current time step. Theevent table 330 is populated with input events at A, C, J, O, P, S, andT based on the content of the event time wheel 340 for the time step1000 ns.

In some embodiments, the bits of the event table 330 are bundled intowide words for the simulation accelerator 110 (at e.g., event manager430) to quickly access. Each bit in this wide word corresponds to aninstruction for indicating whether the instruction has a pending eventat its input(s). Bits that correspond to instructions of a same groupare located in the same word of the pending events table. In someembodiments, all bits that correspond to instructions of a sameinstruction cloud are stored at a same word for quick access by theevent manager 430. This allows the simulation accelerator to examine thepending input event status of many instructions at the same time, suchas when determining which group of instructions has pending events. Thisalso minimizes memory access latency when retrieving and updatingpending input events in the event table 330.

For some embodiments, the event time wheel storage 340 can be consideredas a collection of initial content for the event table at different timesteps. When the simulation accelerator arrives at the current time step,the simulation accelerator 110 (at the event manager 430) retrieves fromthe event time wheel storage 340 the initial content of the event tablefor the current time step. The storage in the event time wheel 340allocated to storing the initial content the event table of the currenttime step is then freed so the event time wheel 340 may store theinitial content of the event table of a future time step.

FIG. 13b illustrates the content of the event time wheel 340 and theinitial content of the event table 330 at a time step 1003 ns. At thetime step 1003 ns, the simulation accelerator has completed executingthe instructions of the time step 1000 ns (groups 1-6) and is set toexecute the instructions of the time step 1003 ns (groups 7-11). Theexecution of the instructions of the time step 1000 ns has updated thecontent of time wheel 340. According to the updated time wheel 340,there are pending events at inputs of instructions aa, bb, cc, dd, gg,and jj. These are initial content of the event table 330 for the timestep 1003 ns. When the simulation time reaches the time step 1003 ns,the simulation accelerator populates the event table 330 with itsinitial content for the time step 1003 ns stored in the event time wheel340, specifically setting pending input events for instructions aa, bb,cc, dd, gg, and jj based on the content of the event time wheel 340. Theevent table 330 is now ready to maintain pending input events of groups7-11.

FIGS. 14a-d illustrate the use of event table and event time wheelduring execution of group-sorted instructions of a time step. Asillustrated, the event table 330 has bits that correspond to inputs ofinstructions A through Z sorted into groups 1-6 (of the instructioncloud 600). The figures illustrate the execution of the instructiongroups 1-6 at the time step 1000 ns in eight stages 1401-1408.

The first stage 1401 shows the simulation accelerator 110 (or the eventmanager 430) with the event table 330 cleared of any pending events forthe current time step. The simulation accelerator then populates thebits of the event table 330 according to the content of the event timewheel 340, which stores the initial content of the event table for timestep 1000 ns.

The second stage 1402 shows the event table populated with pending inputevents based on the content of the event time wheel (based on theexample shown in FIG. 13a at time step 1000 ns). As illustrated, bitscorresponding to inputs of the instructions A, C, J, O, P, S, and T areset to indicate pending input events, while other bits are not set toindicate that there are no pending input events at those inputs.

The third stage 1403 shows the selection of group 1 for execution. Theaccelerator in some embodiments selects a group of instructions byexamining the bits of the event table, i.e., to select a group havingpending input events. Since there are multiple groups with pending inputevents (groups 1, 3, and 4), the accelerator selects a group withpending input events that does not depend on any group within the timestep. In some embodiments, this group is identifiable as the grouphaving the lowest group number in the time step. In this case, group 1is selected for execution because its instructions do not depend onother groups for input.

The stage 1403 also shows the fan-out of each instruction in theexecuted group 1. In this example, the output of A fans out to B, theoutput of C fans out to D and E, the output of J fans out to K, theoutput of O fans out to R, and the output of P fans out to Q. Thecorresponding bits of these destination instructions (B, D, E, K, R, andQ) will be set to indicate that there are pending input events.

At the fourth stage 1404, the bits that correspond to the inputs ofgroup 1 instructions have been cleared. The stage 1404 also shows theselection of group 2 for execution. This is because group 2 has pendinginput events at its instructions (B, D, E, K, Q). This is also becausethe instructions of group 2 depend on only instructions in groups thathave already executed (i.e., group 1). The stage 1404 also shows theoutput of B fans out to “aa”, the output of D fans out to F, the outputof E fans out to G, the output of K fans out to L, X, and Y, the outputof Q fans out to R and S. The corresponding bits of these destinationinstructions (F, G, L, X, Y, R, S) will be set to indicate that thereare pending input events. The instruction “aa” is in a future time step1003 ns, so the accelerator records the pending input event in the eventtime wheel 340 for the future time step.

At the fifth stage 1405, the bits that correspond to the inputs to group2 instructions have been cleared. The stage 1405 also shows theselection of group 3 for execution. This is because group 3 has pendinginput events at its instructions (F, G, R, S). This is also because theinstructions of group 3 depend on only instructions in groups that havealready executed (i.e., groups 1 and 2). The stage 1405 also shows theoutput of F fans out to H and L, the output of G fans out to I, theoutput of R fans out to V, the output of S fans out to T and U. Thecorresponding bits of these destination instructions (H, I, L, T, V, U)will be set to indicate that there are pending input events.

At the sixth stage 1406, the bits that correspond to the inputs to group3 instructions have been cleared. The stage also shows the selection ofgroup 4 for execution. This is because group 4 has pending input eventsat its instructions (H, I, L, T, V). This is also because theinstructions of group 4 depend on only instructions in groups that havealready executed (i.e., groups 1, 2, and 3). The stage 1406 also showsthe output of H fans out to N, the output of I fans out to N, the outputof L fans out to M, the output of T fans out to U, and the output of Vfans out to X. The corresponding bits of these destination instructions(N, M, U, X) will be set to indicate that there are pending inputevents.

The seventh stage 1407 shows bits that correspond to the inputs to group4 instructions have been cleared. The stage also shows the selection ofgroup 5 for execution. This is because group 5 has pending input eventsat its instructions (M, U, X). This is also because the instructions ofgroup 5 depend on only instructions in groups that have already executed(i.e., groups 1, 2, 3, and 4). The stage 1407 also shows the output of Mfans out to N, the output of U fans out to W, and the output of X fansout to Y and Z. The corresponding bits of these destination instructions(N, W, Y, Z) will be set to indicate that there are pending inputevents.

The eighth stage 1408 shows bits that correspond to the inputs to group5 instructions have been cleared. The stage also shows the selection ofgroup 6 for execution. This is because group 6 has pending input eventsat its instructions (N, W, Y, Z). This is also because the instructionsof group 6 depend on only instructions in groups that have alreadyexecuted (i.e., groups 1, 2, 3, 4, and 5). The stage 1408 also shows theoutput of N fans out to “bb”, the output of W fans out to “cc”, theoutput of Y fans out to “dd”, and the output of Z fans out to “gg”. Theinstructions “bb”, “cc”, “dd”, and “gg” are all in a future time step1003 ns, so accelerator records the pending input event in the eventtime wheel 340 for the future time step.

After the stage 1408, the bits that correspond to the inputs to group 5instructions have also been cleared. This would leave the event tableempty for the 1000 ns time step. The simulation accelerator (at theevent manager 430) would therefore know that there is no more pendingevent for the current time step 1000 ns, and the simulation may proceedto the next time step 1003 ns. The event time wheel 340 and the eventtable 330 at start of the time step 1003 ns are provided by FIG. 13babove.

In the example illustrated in FIGS. 14a-d , the output of everyinstruction executed generates pending event that fans out. However, notall executions of an instruction result in changes at the instruction'soutput. (For example, changes at one input of a NAND gate when the otherinput is held at 0 would not result in a change in NAND gate's output).If the output of an instruction does not change following theinstruction's execution, the simulation accelerator in some embodimentswould not follow the fan-out of the instruction to update the eventtable, the event time wheel, or the data memory.

D. Instruction Execution

In some embodiments, the input data to an instruction is (are) stored ata same address location as the instruction itself. In other words, whenthe simulation accelerator 110 (at its instruction/data fetching unit410) fetches an instruction for execution, the same address that is usedto fetch the instruction is also used to fetch the input data to theinstruction. In some embodiments, each instruction is stored at a samememory word as its inputs. This ensures that the simulation acceleratordoes not incur any additional memory access latency when fetching inputdata for an instruction.

FIG. 15 illustrates the data flow during the execution of an instructionat the simulation accelerator. The figure illustrates theinstruction/data fetching unit 410 fetching the instruction and itscorresponding input data from the instruction memory 310 and data memory320. The ALUs 440 executes the fetched instruction based on fetchedinput data. The output of the instruction execution is written back tothe data memory 320 as input for other instructions. The figureillustrates the execution of the instruction in nine operations labeled‘1’ through ‘9’.

At the operation labeled ‘1’, the instruction/data fetching unit 410determines which instruction to fetch and execute based on the contentof the event table (as managed by the event manager 430)

At the operation labeled ‘2’, the instruction/data fetching unit 410issues an address for fetching an instruction and its correspondinginput data. As mentioned, the instruction and its corresponding inputdata are stored at address locations that are accessible by the sameaddress value.

At the operation labeled ‘3’, the instruction/data fetching unit 410retrieves the content of the addressed memory locations from both theinstruction memory and the data memory. The fetched instruction andinput data are forwarded to the ALU 440. In some embodiments, thefetched instruction and input data are buffered at the streaming buffer415, which is a memory structure capable of storing multipleinstructions and their corresponding inputs.

At the operation labeled ‘4’, the instruction/data fetching unitretrieves input data from a data memory cache 325 if there is a cachehit. The data memory cache 325 is a cache that intercepts and storesoutputs of recently executed instructions. In some embodiments, theinput data required by the instruction can be the output of a recentlyexecuted instruction that may not have already been written back intothe data memory (but is instead waiting in a write queue 1520). Theoutput of the recently executed instruction is available in the datamemory cache 325. When there is a cache hit, the input data fetched fromthe data memory cache 325 replaces the input data fetched from the datamemory 320 since the input data fetched from the data memory 320 may notbe up to date.

The data memory cache 325 is a low latency memory structure (e.g.,static RAM) for temporarily storing output data produced by the ALUs.Outputs of each instruction is temporarily held in the data memory cache325 such that subsequent instructions can retrieve their inputs quicklyfrom the data memory cache 325 instead of from the data memory 320. Thedata memory cache 325 as a temporary storage holds only output data frominstructions that are recently executed. A cache hit indicates that therequisite input is available in the data memory cache because the inputis the output of a recently executed instruction. A cache miss on theother hand indicates that the requisite input is not available in thedata memory cache because the input is the output of an instruction notso recently executed. In that case the updated input data is assumed toalready be in the data memory 320.

For example, in FIG. 14a , the output data produced by instructions ofgroup 1 are stored in the data memory cache 325 and are available asinput data for instructions of group 2, and the output data produced bythe instructions of group 2 are stored in the data memory cache 325 andare available as input data for instructions of group 3, etc. A largerdata memory cache 325 would be able to hold data longer such that theoutput data produced by a particular group of instructions can beavailable as input data for more subsequent groups of instructions.

At the operation labeled ‘5’, the ALU 440 executes the fetchedinstruction based on its corresponding fetched input data.

At the operation labeled ‘6’, the ALU 440 writes the output of theexecuted instruction to its destination(s). An instruction that producesan output also specifies the fan-out destination instruction(s) that is(are) to receive the output. For each fan-out destination that is toreceive a copy of the instruction' output data, the instructionspecifies an address tuple that includes the destination's groupidentifier, instruction address, and input offset. The address tuple isused to specify the location in the data memory that is to store theoutput data. The address tuple and the output data are stored in thewrite queue 1520 to wait for opportunity to be written into the datamemory.

Since the instructions are executed on a group-by-group basis and theoutputs of the instructions in a current group are always destined forinstructions in subsequent groups, the outputs of the instructions ofthe current group can be kept in the write queue 1520 until after thecurrent group has completed execution. This minimizes memory accesslatency by not interfering with page read operations. In someembodiments, the data access unit 420 manages the queuing of writeoperations at the write queue 1520. In some embodiments, a destinationlocation that is in the same DRAM page as the current group is writtenas soon as the execution of the current group of instructions iscomplete, while a destination location that falls outside of the currentDRAM page is written later to minimize DRAM page access setup cost.

At the operation labeled ‘7’, the output data produced by the ALU 440 iswritten into the data memory cache 325 so the data will be available asinput data for instructions to be executed at the near future (e.g.,instructions in the next group).

At the operation labeled ‘8’, the data access unit 420 updates the eventtable 330 and/or the event time wheel 340 through the event manager 430.The event manager 430 clears the pending input events for instructionsthat were just executed and sets pending input events for destinationinstructions.

At the operation labeled ‘9’, the data access unit 420 moves the outputdata from the write queue 1520 to the data memory 320. Each output datahas one or more fan-out destinations that informs the data access unit420 where to write the output data. Each fan-out destination is alocation in the data memory 320 that corresponds to the input area of adestination instruction. That destination instruction will use theoutput data written in that destination location as input for execution.Writing instruction's output data to the data memory will be furtherdescribed by reference to FIGS. 19, 20, and 21 below.

FIG. 16 illustrates the format of the content in the instruction memoryand in the data memory. As mentioned, the instructions of the simulationaccelerator are group-sorted. The storage of instructions at theinstruction memory and the storage of inputs at the data memory arecorrespondingly group-sorted. As illustrated, each group of instructionshas a unique identifier, and the group identifier is used as the mostsignificant part of the address for accessing instructions and data.Thus, the instructions and their input data are organized into groups byvirtue of having different group identifier. Within each group, eachinstruction has an instruction address that is unique within the group.In some embodiments, this instruction address serves as the nextsignificant part of the address (after group identifier) for accessinginstructions and data. In some embodiments, each group may have up to2048 instructions (11 address bits).

For some embodiments, each instruction includes several physical wordsin the physical memory. In the example illustrated in FIG. 16, eachinstruction includes 8 physical words covering 8 physical addresslocations. The same group identifier, instruction address, and physicalword address are used to fetch the instruction from the instructionmemory 310 and to fetch the input data from the data memory 320.

The figure shows the format of the content of each instruction. Asillustrated, the words allocated to an instruction in the instructionmemory 310 contain various components of the instruction, including itsALU opcode 1610, input specification 1620, and output specification1630. The ALU opcode 1610 specifies the operations that an ALU (in theALU array 440) will perform when executing the instruction. The inputspecification 1620 specifies the format of the input data at the datamemory 320 for the instruction, e.g., the number of inputs and the widthof the inputs.

The output specification 1630 specifies the fan-out of the instruction,i.e., where should the simulation accelerator store the output of theinstruction execution. As illustrated, the output specification 1630specifies the number of destinations (i.e., the number of fan-outs), andthe location of each destination. Each destination location specifies aninput of a destination instruction by specifying the group identifier ofthe destination instruction, the instruction address of the destinationinstruction, and an input offset targeting a specific input of thedestination instruction.

The figure also shows the format of the data memory 320. The data memorystores the corresponding input data for instructions in the instructionmemory. For example, the instruction 1601 has corresponding input area1671 in the data memory, the instruction 1602 has corresponding inputarea 1672 in the data memory, etc. For each instruction, the data memorystores its input data according to the format specified by theinstruction (i.e., the input specification 1620), which specifies thenumber of inputs and the width of each input. When an earlier executedinstruction (or source instruction) specifies say, instruction 1673 asone of its destination instructions, the simulation accelerator wouldstore the output of the earlier executed instruction into the input area1673 of the instruction 1603 (at the input offset specified by thesource instruction targeting one of the inputs in the input area 1673).

As mentioned, in some embodiments, the simulation accelerator would notwrite the output of an instruction to its fan-out destinations if theexecution of the instruction does not change its output. In someembodiments, the simulation accelerator stores a copy of the output ofthe instruction at the instruction's input area. This allows thesimulation accelerator to determine whether the execution of theinstruction has changed its output by comparing the new output of theinstruction with its previous output stored at the data memory.

FIG. 17 conceptually illustrates a process 1700 for performing RTLsimulations by using a simulation accelerator. The simulationaccelerator 110 performs the process 1700 when it executes group-sortedinstructions. Before the start of the process 1700, the simulationaccelerator 110 has already received compiled RTLs in the form ofgroup-sorted instructions from the compiler 195. The group-sortedinstructions are stored in the instruction memory of the simulationaccelerator 110. The process 1700 starts when the simulation acceleratorreceives (at 1710) a command to commence simulation from the hostcomputer 190, or from the simulation processor 120. The process alsosets the time step to an initial simulation time specified by the userthrough the host computer (usually 0).

The process 1700 receives (at 1720) stimulus from testbench and updateevent time wheel for the current simulation time step. In someembodiments, the testbench includes models for providing stimulus totest the DUT RTL. Some of these models are programs compiled to run onthe simulation processor 120, and the simulation processor 120 providesthe stimulus to the simulation accelerator 110 to drive the RTLs. Thesimulation accelerator in turn stores the received stimulus in the eventtime wheel. The process then populates (at 1730) the event table for thecurrent time step based on the content of the event time wheel. Theevent table records the pending input event status for the instructionsthat are active for the current time step. The operations related toevent time wheel and event table are described in Section III.C above.

Next, the process 1700 determines (at 1740) whether any group ofinstructions in the compiled RTL has pending input events according tothe event table. If the event table is cleared of any pending inputevent for the current time step, the process proceeds to 1750. If theevent table indicates that there are still pending input event for thecurrent time step, the process proceeds to 1760.

At 1750, the process 1700 advances the simulation time to the next timestep and returns to 1720 to update event time wheel and event table. Ifthe current time step is the last time step in the simulation (asspecified by the user or by the testbench), the process 1700 ends.

At 1760, the process 1700 selects a group of instructions having pendingevents at their inputs according to the event table. In someembodiments, when there are multiple groups of instructions havingpending input events, the process selects a group whose group identifieris the lowest, or a group that does not depend on any group within thetime step that has pending input events. The process then proceeds to1770.

At 1770, the process 1700 executes the instructions of the group. Insome embodiments, the process fetches the instructions and theircorresponding input data into a streaming buffer by using burst mode.The process executes the instructions in the streaming buffer, updatesthe event table, and writes output data to the data memory according tothe executed instruction. In some embodiments, the process performs theoperation 1770 by performing the process 1800 of FIG. 18. The processthen returns to 1740 to execute another group of instructions in thesame simulation time step or in the next simulation time step.

FIG. 18 conceptually illustrates a process 1800 for executing a group ofinstructions. In some embodiments, the simulation accelerator performsthe process 1800 when it performs the operation 1770.

The process 1800 starts by fetching (at 1810) the instructions of thegroup and their corresponding input data by using the identifier of thegroup as address to the instruction memory and data memory. In someembodiments, only instructions that are identified as having pendinginput by the event table are fetched. The fetched instructions and dataare stored into a streaming buffer. For some embodiments in which thesimulation accelerator uses a data memory cache to store output datafrom recently executed instructions, the process also fetches (at 1815)input data from the data memory cache for instruction inputs that havevalid corresponding entries in the cache (i.e., cache hit).

Next, the process 1800 receives (at 1820) one fetched instruction andits corresponding input data (from the streaming buffer). The processthen determines (at 1830) whether the received instruction has pendinginput event by examining the event table. If so, the process proceeds to1840. If the received instruction has no pending input event, theprocess proceeds to 1870.

At 1840, the process 1800 executes the received instruction with itscorresponding input data to compute an output. The process then updates(at 1850) the event table by clearing the pending input event for theexecuted instruction. The process 1800 then proceeds to 1860.

At 1860, the process 1800 writes the output of the executed instructionto its fan-out destination locations in the data memory. The processthen proceeds to 1870. In some embodiments, the simulation acceleratorstores the output data write operation in a write queue (e.g., the writequeue 1520) while the process 1800 proceeds to execute otherinstructions.

At 1870, the process 1800 determines whether there are more instructionsin the group that have yet to be executed. The process in someembodiments makes this determination by examining whether there are moreinstructions in the streaming buffer that have yet to be executed. Ifthere is at least one more instruction yet to be executed, the processreturns to 1820 to receive and execute another instruction. Otherwise,the process 1800 ends.

FIG. 19 conceptually illustrates a process 1900 for writing output dataof an executed instruction to its fan-out locations. In someembodiments, the simulation accelerator performs the process 1900 aspart of the operation 1860 to write the output of the executedinstruction to its fan-out destination locations.

The process 1900 starts when the simulation accelerator 110 hascompleted execution of an instruction and produced an output. Theprocess determines (at 1910) whether the execution of the instructionchanges the output of the instruction. In order to eliminate unnecessarywrite operations, the simulation accelerator in some embodimentspropagates the output data of an executed instruction only when theoutput data has changed from previous execution of the instruction. Ifthe output has changed, the process proceeds to 1920. If the output hasnot changed, the process 1900 ends without writing to the data memory.

At 1920, the process stores the output of the instruction in the datamemory so the simulation accelerator may determine whether a futureexecution of the instruction has changed the output of the instruction.

The process 1900 identifies (at 1930) the group ID, the instructionaddress, and the input offset for each fan-out destination of theinstruction. These information are available in the instruction memory310 as part of the output specification 1630 portion of the instruction,which also specifies how many fan-out destinations that the instructionhas.

The process 1900 stores (at 1940), for each fan-out destination, theidentified group ID, the instruction address, and the input offset as atuple with the output data into the write queue (e.g., 1520). Thecontent of the write queue will be moved into the data memory later. Forsome embodiments in which the simulation accelerator uses a data memorycache to store output data from recently executed instructions, theprocess also stores output data into the data memory cache by using theidentified group ID, instruction address, and input offset as index.

Next, the process 1900 sets (at 1950) pending input event in the eventtable for each fan-out destination. The process 1900 then ends.

As mentioned, in some embodiments, the instruction memory 310 and thedata memory 320 are implemented by using DRAMs in order to increase datadensity and to lower cost. Since DRAMs are divided into pages, thesimulation accelerator queues data write operations so the actual writesto the data memory can take place later with smaller page-changepenalties. In some other embodiments, the instruction memory 310 and thedata memory 320 are implemented by using static RAMs that do not havepages. The simulation accelerator in some of these embodiments do notqueue data write operations before writing the output data into the datamemory 320.

FIG. 20 conceptually illustrates the queuing of output data writeoperations that are generated by execution of instructions. In sixstages 2001-2006, the figure illustrates the generation of writeoperations, the storing of write operations at the write queue 1520, andthe moving of the output data from the write queue 1520 to the datamemory 320. Though not illustrated, in some embodiments, each outputdata is also written into the data memory cache 325 so it will beimmediately ready for retrieval by upcoming groups.

The first stage 2001 shows the ALU 440 executing fetched instructionsfor group 1. The execution of each instruction generates output datadestined for one or more fan-out destinations. For each fan-outdestination, the simulation accelerator generates an n-tuple thatincludes group ID, instruction address, input offset, and output data.The n-tuple is stored in the write queue 1520. The n-tuple is alsostored in the data memory cache 325 so it can be retrieved quickly forthe upcoming groups. As illustrated, the execution of the instructionsof group 1 has generated write operations for at least four fan-outdestinations. These fan-out destinations include instructions in groups2, 3, and 10.

The second stage 2002 shows the moving of the output data from the writequeue 1520 to the data memory 320. For each queued n-tuple of an outputdata write operation, the simulation accelerator uses the group ID,instruction address, and input offset as write address to write to thedata memory 320.

The simulation accelerator may have a limited window for moving thequeued write operations into the data memory. In some embodiments, thesimulation accelerator would therefore move output data needed by thenext group of instructions first. In this example, the simulationaccelerator has identified group 2 as the next group of instructions tobe executed. The accelerator hence moves the output data destined forgroup 2 from the write queue 1520 into the data memory 320 (since theseare the output data that will be needed for execution). Some embodimentsmove other queued output data into the data memory as well if doing sowould not affect the performance of the simulation accelerator.

The third stage 2003 shows the fetching and execution of theinstructions of group 2. For some embodiments in which output data ofeach instruction is stored in the data memory cache 1520, the inputs ofthe upcoming group of instructions are already available in the cache sothe fetching and execution of instructions can proceed without waitingfor the updated input data to be moved into the data memory 320 from thewrite queue 1520.

For some embodiments in which there is no data memory cache, thefetching and execution of instructions has to wait for updated inputdata to be stored into the data memory 320 from the write queue 1520.Once the updated input data for group 2 instructions have all been movedinto the data memory from the write queue, the instructions of group 2can safely execute. The execution of the instructions of group 2produces several more write operations, including at least three fan-outdestinations in groups 3 and 4. These outputs are written into the writequeue 1520 and/or the data memory cache 325.

The fourth stage 2004 shows the writing of the output data from thewrite queue 1520 to the data memory 320. Since the simulationaccelerator has identified group 3 as the next group of instructions tobe executed, the accelerator moves the output data destined for group 3from the write queue 1520 into the data memory 320.

The fifth stage 2005 shows the fetching and execution of the instructionof group 3. Since the output data of destinations in group 3 have eitherall been moved into the data memory in stage 2004 from the write queue1520 or is available in the data memory cache 325, the instructions ingroup 3 would execute with up-to-date input data. The execution producesseveral more write operations, including at least three fan-outdestinations in groups 4 and 5. These outputs are written into the writequeue 1520 and/or the data memory cache 325.

The sixth stage 2006 shows the writing of the output data from the writequeue 1520 to the data memory 320. Since the simulation accelerator hasidentified group 4 as the next group of instructions to be executed, itmoves the output data destined for group 4 from the write queue 1520into the data memory 320.

FIG. 21 conceptually illustrates two processes 2101 and 2102 for movingoutput data from the write queue to the data memory. In someembodiments, the simulation accelerator performs the processes 2101 and2102 at the data access unit 420. For some embodiments in which thesimulation accelerator does not employ a data memory cache, thesimulation accelerator performs the process 2101 for moving output datafrom the write queue 1520 into the data memory 320 in order to ensurethat the input data needed by the next group of instructions will beready. For some embodiments in which the outputs of instructionexecution are also stored in a data memory cache (as discussed above byreference to FIG. 15), the simulation accelerator 110 does not performthe process 2101 but instead perform the process 2102 to move outputdata from the write queue 1520 into the data memory 320 whenever thedata memory is ready to accept write operations into a particular page.

The process 2101 starts whenever there are output data n-tuples waitingin the write queue to be written into the data memory. The processstarts by waiting (at 2110) for an opportunity to write into the datamemory. For some embodiments in which the data memory is implemented byDRAM, the process would wait for a current burst of read access tocomplete before moving data from the write queue to the data memory.

Next, the process 2101 identifies (at 2120) the next group ofinstructions scheduled to be executed. The next group of instructionswill need input data at the data memory in order to execute. In someembodiments, the process also sets the necessary control to prevent thefetching of the next group of instructions until the data access unithas completed transporting output data from the write queue to the inputarea of the instructions of the next group.

The process 2101 next identifies (at 2130) output data tuple(s) in thewrite queue that are destined for the identified next group. Each outputdata tuple represents a fan-out write operation to an input of adestination instruction. Each output data tuple is an n-tuple thatincludes the group ID, the instruction address, and the input offset ofthe destination, along with the output data.

The process 2101 then moves (at 2140) output data from the write queueinto the data memory according to identified output data n-tuples.Specifically, for each identified output data tuple, the process writesthe output data of the n-tuple at a location addressed by the group ID,the instruction address, and the input offset of the n-tuple. This wouldwrite all output data destined for the identified next group ofinstructions into the data memory and ready for execution. The processthen allows (at 2150) fetching of instructions for the identified nextgroup since the inputs to those instructions are ready. The process 2101then returns to 2110.

In some embodiments, the process 2101 would continue to move output datadestined for other groups from the write queue into the data memory inthe background if it does not interfere with other memory accessoperations.

The process 2102 starts by waiting (at 2160) until the data memory isready to accept write operations. In some embodiments, the data memoryhas only one port and can only perform either read operation or writeoperation but not at the same time. The process 2102 in some of theseembodiments wait until the data memory is not performing readoperations. The process 2102 then identifies (at 2170) a page in thedata memory that is ready for write operations. This is usually thecurrent page that the instruction/data fetching unit is currentlyfetching instructions and input data from.

Next, the process 2102 identifies (at 2180) output data tuples in thewrite queue that are destined for the identified page, i.e., output datatuples whose destination instructions belong to a group that resides inthe identified page in the DRAM. As mentioned above, each group ofinstructions is confined to a page in the DRAM.

The process 2102 then moves (at 2190) the identified output data tuplesfrom the write queue to the data memory. Specifically, for eachidentified output data tuple, the process writes the output data of thetuple at a location addressed by the group ID, the instruction address,and the input offset of the tuple. The process 2102 then returns to2160.

E. Instrumentation

Instrumentation presents a challenge for traditional hardware emulators.For hardware emulators, changing the set of observed nodes often forcesrecompilation, because the instrumentation for trace capture may requireconfiguration of routing resources that are already configured toemulate hardware components. This greatly hampers debugging processsince the design engineer often has to wait for re-compilation andre-simulation merely to add observability into the testbench or the DUTRTL.

In some embodiments, the simulation accelerator provides the content ofthe data memory to the host machine to provide observability into theRTL being simulated. Since the content of the data memory records theinput data to each instruction of the simulated RTL, these data arealready available for observation without recompilation of thetestbench. In some of these embodiments, the content of the data memoryis periodically dumped out to a mass storage (e.g., the simulationstorage 135 or the host storage 130) so they can be available forobservation or viewing at the host computer system 190.

FIG. 22 illustrates instrumentation by the simulation system 100. Asillustrated, the simulation accelerator 110 of the simulation system 100is performing a simulation to test a DUT RTL. The simulation is based oninstructions stored in the instruction memory 310 and input data storedin data memory 320. The ALUs 440 executes the instructions and store theoutputs of the instructions back to the data memory as inputs for otherinstructions. The data access unit 420 manages the writing of outputdata into the data memory 320 and also the dumping out ofinstrumentation data to the simulation storage 135. In some embodiments,the data access unit 420 periodically dumps out the content of the datamemory as instrumentation data into the simulation storage 135, such aswhenever the simulation accelerator has completed executing a group ofinstructions. In some embodiments, the data access unit 420 interceptsthe outputs of instructions being written to the data memory 320 anddumps them as instrumentation data to the simulation storage 135. Thedump out stored in the simulation storage 135 includes inputs todifferent instructions at different simulation time steps.

In some embodiments, the instrumentation data is transported to the hostcomputer as simulation result (185) so the host computer 190 can presentthe instrumentation data to the user for design verification.

IV. Electronic System

FIG. 23 conceptually illustrates an electronic system 2300 with whichsome embodiments of the invention are implemented. The electronic system2300 can be used to execute any of the control, virtualization, oroperating system applications described above. The electronic system2300 may be a computer (e.g., a desktop computer, personal computer,tablet computer, server computer, mainframe, a blade computer etc.),phone, PDA, or any other sort of electronic device. Such an electronicsystem includes various types of computer readable media and interfacesfor various other types of computer readable media. Electronic system2300 includes a bus 2305, processing unit(s) 2310, a system memory 2325,a read-only memory 2330, a permanent storage device 2335, input devices2340, and output devices 2345.

The bus 2305 collectively represents all system, peripheral, and chipsetbuses that communicatively connect the numerous internal devices of theelectronic system 2300. For instance, the bus 2305 communicativelyconnects the processing unit(s) 2310 with the read-only memory 2330, thesystem memory 2325, and the permanent storage device 2335.

From these various memory units, the processing unit(s) 2310 retrievesinstructions to execute and data to process in order to execute theprocesses of the invention. The processing unit(s) may be a singleprocessor or a multi-core processor in different embodiments.

The read-only-memory (ROM) 2330 stores static data and instructions thatare needed by the processing unit(s) 2310 and other modules of theelectronic system. The permanent storage device 2335, on the other hand,is a read-and-write memory device. This device is a non-volatile memoryunit that stores instructions and data even when the electronic system2300 is off. Some embodiments of the invention use a mass-storage device(such as a magnetic or optical disk and its corresponding disk drive) asthe permanent storage device 2335.

Other embodiments use a removable storage device (such as a floppy disk,flash drive, etc.) as the permanent storage device. Like the permanentstorage device 2335, the system memory 2325 is a read-and-write memorydevice. However, unlike storage device 2335, the system memory is avolatile read-and-write memory, such a random access memory. The systemmemory stores some of the instructions and data that the processor needsat runtime. In some embodiments, the invention's processes are stored inthe system memory 2325, the permanent storage device 2335, and/or theread-only memory 2330. From these various memory units, the processingunit(s) 2310 retrieves instructions to execute and data to process inorder to execute the processes of some embodiments.

The bus 2305 also connects to the input and output devices 2340 and2345. The input devices enable the user to communicate information andselect commands to the electronic system. The input devices 2340 includealphanumeric keyboards and pointing devices (also called “cursor controldevices”). The output devices 2345 display images generated by theelectronic system. The output devices include printers and displaydevices, such as cathode ray tubes (CRT) or liquid crystal displays(LCD). Some embodiments include devices such as a touchscreen thatfunction as both input and output devices.

Finally, as shown in FIG. 23, bus 2305 also couples electronic system2300 to a network 2365 through a network adapter (not shown). In thismanner, the computer can be a part of a network of computers (such as alocal area network (“LAN”), a wide area network (“WAN”), or an Intranet,or a network of networks, such as the Internet. Any or all components ofelectronic system 2300 may be used in conjunction with the invention.

Some embodiments include electronic components, such as microprocessors,storage and memory that store computer program instructions in amachine-readable or computer-readable medium (alternatively referred toas computer-readable storage media, machine-readable media, ormachine-readable storage media). Some examples of such computer-readablemedia include RAM, ROM, read-only compact discs (CD-ROM), recordablecompact discs (CD-R), rewritable compact discs (CD-RW), read-onlydigital versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), a varietyof recordable/rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.),flash memory (e.g., SD cards, mini-SD cards, micro-SD cards, etc.),magnetic and/or solid state hard drives, read-only and recordableBlu-Ray® discs, ultra density optical discs, any other optical ormagnetic media, and floppy disks. The computer-readable media may storea computer program that is executable by at least one processing unitand includes sets of instructions for performing various operations.Examples of computer programs or computer code include machine code,such as is produced by a compiler, and files including higher-level codethat are executed by a computer, an electronic component, or amicroprocessor using an interpreter.

While the above discussion primarily refers to microprocessor ormulti-core processors that execute software, some embodiments areperformed by one or more integrated circuits, such as applicationspecific integrated circuits (ASICs) or field programmable gate arrays(FPGAs). In some embodiments, such integrated circuits executeinstructions that are stored on the circuit itself.

As used in this specification, the terms “computer”, “server”,“processor”, and “memory” all refer to electronic or other technologicaldevices. These terms exclude people or groups of people. For thepurposes of the specification, the terms display or displaying meansdisplaying on an electronic device. As used in this specification, theterms “computer readable medium,” “computer readable media,” and“machine readable medium” are entirely restricted to tangible, physicalobjects that store information in a form that is readable by a computer.These terms exclude any wireless signals, wired download signals, andany other ephemeral signals.

While the invention has been described with reference to numerousspecific details, one of ordinary skill in the art will recognize thatthe invention can be embodied in other specific forms without departingfrom the spirit of the invention. In addition, a number of the figures(including FIGS. 17, 18, 19, and 21) conceptually illustrate processes.The specific operations of these processes may not be performed in theexact order shown and described. The specific operations may not beperformed in one continuous series of operations, and different specificoperations may be performed in different embodiments. Furthermore, theprocess could be implemented using several sub-processes, or as part ofa larger macro process. Thus, one of ordinary skill in the art wouldunderstand that the invention is not to be limited by the foregoingillustrative details, but rather is to be defined by the appendedclaims.

1-20. (canceled)
 21. A method comprising: receiving a specification of adigital circuit, the specification comprising a plurality of groups ofinstructions; maintaining a pending events table in an integratedcircuit (IC), each bit of the pending events table indicating absence orpresence of a pending event at an input of an instruction in theplurality of instructions; selecting a group of instructions havingpending input events by examining the pending events table; executing,in the IC, the selected group of instructions to produce outputs toserve as inputs for destination instructions in other groups ofinstructions; and updating the pending events table by clearing bits inthe pending events table that correspond to inputs of the selected groupand setting bits in the pending events table that correspond to inputsof the destination instructions.
 22. The method of claim 21, wherein thebits indicating absence or presence of pending events at the inputs ofthe instructions of the selected group are located in a same word of thepending events table.
 23. The method of claim 21, wherein executing acurrent instruction in the selected group of instructions furthercomprises identifying a destination instruction in another group ofinstructions that receives a fan-out of the current instruction andsetting pending input event for the identified destination instructionin the pending events table.
 24. The method of claim 21, wherein thepending events table stores bits that correspond to groups ofinstructions that are scheduled to execute in a current time step butnot instructions that are scheduled to execute in other time steps. 25.The method of claim 21 further comprising advancing a simulation time toa next time step when all bits of the pending events table are cleared.26. The method of claim 25 further comprising populating the pendingevents table with contents of a time wheel storage for the next timestep.
 27. The method of claim 21 further comprising maintaining a timewheel storage for storing pending events at inputs of instructionsscheduled to execute in a future time step after a current time step.28. The method of claim 27 further comprising storing a pending inputevent into the time wheel storage when a destination instruction isscheduled to execute in a future time step.
 29. An integrated circuit(IC) comprising: an instruction memory storing a plurality of groups ofinstructions; an event manager circuit configured to (i) maintain apending events table, each bit of the pending events table indicatingabsence or presence of a pending event at an input of an instruction inthe plurality of instructions, (ii) select a group of instructions byidentifying an instruction having a pending input event in the pendingevents table, and (iii) update the pending events table by clearing bitsin the pending events table that correspond to inputs of the selectedgroup and setting bits in the pending events table that correspond toinputs of destination instructions; and a set of processing unitsconfigured to execute the selected group of instructions to produceoutputs to serve as inputs for the destination instructions.
 30. The ICof claim 29, wherein the bits indicating absence or presence of pendingevents at the inputs of the instructions of the selected group arelocated in a same word of the pending events table.
 31. The IC of claim29, wherein the pending events table stores bits that correspond togroups of instructions that are scheduled to execute in a current timestep but not instructions that are scheduled to execute in other timesteps.
 32. The IC of claim 29, wherein a simulation time is advanced toa next time step when all bits of the pending events table are cleared,wherein the event manager circuit populates the pending events tablewith contents of a time wheel storage for the next time step when allbits of the pending events table are cleared.
 33. The IC of claim 29,wherein the event manager circuit is further configured to maintain atime wheel storage for storing pending events at inputs of instructionsscheduled to execute in a future time step after a current time step.34. The IC of claim 33, wherein the event manager circuit is furtherconfigured to storing a pending input event into the time wheel storagewhen a destination instruction is scheduled to execute in a future timestep.
 35. A simulation system comprising: a simulation processorconfigured to execute a set of compiled models to generate stimulus fortesting a design of a digital circuit; and a simulation acceleratorconfigured to perform acts comprising: receiving a plurality of groupsof instructions emulating a behavior of the digital circuit by applyingthe generated stimulus; maintaining a pending events table in anintegrated circuit (IC), each bit of the pending events table indicatingabsence or presence of a pending event at an input of an instruction inthe plurality of instructions; selecting a group of instructions havingpending input events by examining the pending events table; executing,in the IC, the selected group of instructions to produce outputs toserve as inputs for destination instructions in other groups ofinstructions; and updating the pending events table by clearing bits inthe pending events table that correspond to inputs of the selected groupand setting bits in the pending events table that correspond to inputsof the destination instructions.
 36. The simulation system of claim 35,wherein the bits indicating absence or presence of pending events at theinputs of the instructions of the selected group are located in a sameword of the pending events table.
 37. The simulation system of claim 35,wherein the pending events table stores bits that correspond to groupsof instructions that are scheduled to execute in a current time step butnot instructions that are scheduled to execute in other time steps. 38.The simulation system of claim 35, wherein the simulation accelerator isfurther configured to advance a simulation time to a next time step whenall bits of the pending events table are cleared.
 39. The simulationsystem of claim 38, wherein the simulation accelerator is furtherconfigured to populate the pending events table with contents of a timewheel storage for the next time step.
 40. The simulation system of claim35, wherein the simulation accelerator is further configured to maintaina time wheel storage for storing pending events at inputs ofinstructions scheduled to execute in a future time step after a currenttime step and storing a pending input event into the time wheel storagewhen a destination instruction is scheduled to execute in a future timestep.